Approximability and Hardness in Multi-objective Optimization
نویسندگان
چکیده
– We define approximative solution notions and investigate in which cases polynomial-time solvability translates from one to another notion. Moreover, for problems where all objectives have to be minimized, approximability results translate from single-objective to multiobjective optimization such that the relative error degrades only by a constant factor. Such translations are not possible for problems where all objectives have to be maximized (unless P = NP).
منابع مشابه
Hardness and Approximability in Multi-Objective Optimization
We systematically study the hardness and the approximability of combinatorial multiobjective NP optimization problems (multi-objective problems, for short). We define solution notions that precisely capture the typical algorithmic tasks in multiobjective optimization. These notions inherit polynomial-time Turing reducibility from multivalued functions, which allows us to compare the solution no...
متن کاملReliability-Based Robust Multi-Objective Optimization of Friction Stir Welding Lap Joint AA1100 Plates
The current paper presents a robust optimum design of friction stir welding (FSW) lap joint AA1100 aluminum alloy sheets using Monte Carlo simulation, NSGA-II and neural network. First, to find the relation between the inputs and outputs a perceptron neural network model was obtained. In this way, results of thirty friction stir welding tests are used for training and testing the neural network...
متن کاملNew Directions in Approximation Algorithms and Hardness of Approximation
Combinatorial optimization encompasses a wide range of important computational tasks such as UNIFORMSPARSESTCUT (also known as NORMALIZEDCUT), MAXCUT, TRAVELINGSALESMANPROBLEM, and VERTEXCOVER. Most combinatorial optimization problems are NP-hard to be solved optimally. On one hand, a natural way to cope with this computational intractability is via designing approximation algorithms to efficie...
متن کاملApproximation of the Quadratic Knapsack Problem
We study the approximability of the classical quadratic knapsack problem (QKP) on special graph classes. In this case the quadratic terms of the objective function are not given for each pair of knapsack items. Instead an edge weighted graph G = (V, E) whose vertices represent the knapsack items induces a quadratic profit pij for the items i and j whenever they are adjacent in G (i.e (i, j) ∈ E...
متن کاملEvolving Hard and Easy Traveling Salesman Problem Instances: A Multi-objective Approach
It becomes a great challenge in the research area of metaheuristics to predict the hardness of combinatorial optimization problem instances for a given algorithm. In this study, we focus on the hardness of the traveling salesman problem (TSP) for 2-opt. In the existing literature, two approaches are available to measure the hardness of TSP instances for 2-opt based on the single objective: the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010